Properties of Multiset Language Classes Defined by Multiset Storage Automata
نویسندگان
چکیده
The previously introduced multiset language classes defined by multiset storage automata are being explored with respect to their closure properties and alternative characterizations.
منابع مشابه
Multiset Storage Automata
Two kinds of multiset automata with a storage attached, varying only in their ability of testing the storage for emptiness, are introduced, as well as normal forms. Their accepting power and relation to other multiset languages classes is investigated.
متن کاملOn the properties of language classes defined by bounded reaction automata
Reaction automata are a formal model that has been introduced to investigate the computing powers of interactive behaviors of biochemical reactions([14]). Reaction automata are language acceptors with multiset rewriting mechanism whose basic frameworks are based on reaction systems introduced in [4]. In this paper we continue the investigation of reaction automata with a focus on the formal lan...
متن کاملPushdown automata, multiset automata, and Petri nets
In this paper, we consider various classes of (in)nite-state) automata generated by simple rewrite transition systems. These classes are de)ned by two natural hierarchies, one given by interpreting concatenation of symbols in the rewrite system as sequential composition, and the other by interpreting concatenation as parallel composition. In this way, we provide natural definitions for commutat...
متن کاملOn fuzzy multiset regular grammars
The main goal of this paper is to introduce and study fuzzy multiset regular grammar to show that fuzzy multiset finite automata and fuzzy multiset regular grammars are equivalent. We also study fuzzy multiset linear grammars and fuzzy multiset regular grammars in normal form. Furthermore, we show the equivalence of fuzzy multiset regular grammars, fuzzy multiset left linear grammars, fuzzy mul...
متن کاملTaxonomy of In nite State ProcessesFaron
In this tutorial paper, we consider various classes of automata generated by simple rewrite transition systems. These classes are deened by two natural hierarchies, one given by interpreting concatenation of symbols in the rewrite system as sequential composition, and the other by interpreting concatenation as parallel composition. In this way we provide natural deenitions for commutative (para...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009